Pipelined recursive modified Euclidean algorithm block for low-complexity, high-speed Reed–Solomon decoder
نویسندگان
چکیده
A novel pipelined recursive modified Euclidean (ME) algorithm block for the low-complexity, high-speed Reed–Solomon (RS) decoder is presented. The deeply pipelined recursive structure enables implementation of a significantly low-complexity ME algorithm block with much improved clock frequency. The low-complexity, high-speed RS decoder using the pipelined recursive ME algorithm block has been implemented in 0.13 mm CMOS technology with a supply voltage of 1.1 V. The results show that it has significantly low hardware complexity and a high data processing rate of 6.16 Gbit=s.
منابع مشابه
A Low-Complexity, High-Speed Reed-Solomon Decoder
This paper presents a low-complexity, high-speed RS(255,239) decoder architecture using Modified Euclidean (ME) algorithm for the high-speed fiber optic communication systems. The RS decoder features a low-complexity key equation solver using a novel pipelined recursive ME algorithm block. Pipelining allows inputs to be received at very high fiber optic rates and outputs to be delivered at corr...
متن کاملA High-Speed Low-Complexity Time-Multiplexing Reed-Solomon-Based FEC Architecture for Optical Communications
A high-speed low-complexity time-multiplexing ReedSolomon-based forward error correction architecture based on the pipelined truncated inversionless Berlekamp-Massey algorithm is presented in this paper. The proposed architecture has very high speed and very low hardware complexity compared with conventional ReedSolomon-based forward error correction architectures. Hardware complexity is improv...
متن کاملHigh-speed VLSI architecture for parallel Reed-Solomon decoder
This paper presents high-speed parallel Reed–Solomon (RS) (255,239) decoder architecture using modified Euclidean algorithm for the high-speed multigigabit-per-second fiber optic systems. Pipelining and parallelizing allow inputs to be received at very high fiber-optic rates and outputs to be delivered at correspondingly high rates with minimum delay. Parallel processing architecture results in...
متن کاملAn Area-Efficient Euclidean Algorithm Block for Reed-Solomon Decoder
This paper presents a new area-efficient architrecture to implement the Euclidean algorithm, which is frequently used in Reed-Solomon decoders. The RS (255,239) decoder using the Euclidean algorithm has been implemented with 0.13m CMOS technology with a supply voltage of 1.1V . We investigate hardware complexity, clock frequency and data processing rate for this Euclidean algorithm block. The r...
متن کاملAn area-efficient VLSI architecture for decoding of Reed-Solomon codes
This paper presents a new pipelined VLSI array for decoding Reed-Solomon (RS) codes. The architecture is designed based on the modified time-domain BerlekampMassey algorithm incorporated with the remainder decoding concept. A prominent feature of the proposed system is that, for a t-error-correcting RS code with block length n, it involves only 2t consecutive symbols to compute a discrepancy va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001